A Bi-Level Path Planning Algorithm for Multi-AGV Routing Problem
نویسندگان
چکیده
منابع مشابه
Conflict-free AGV Routing in a Bi-directional Path Layout
AGV systems are now becoming widely used in automatic material handling systems. One of the issues arising in applications is routing. This paper presents a bi-directional path layout and an algorithm for routing AGVs without conflicts. Mathematical relationships among certain key parameters of path and vehicle are derived to minimize the space requirements of the layout. The routing efficiency...
متن کاملA multi-objective memetic algorithm for risk minimizing vehicle routing problem and scheduling problem
In this paper, a new approach to risk minimizing vehicle routing and scheduling problem is presented. Forwarding agents or companies have two main concerns for the collection of high-risk commodities like cash or valuable commodities between the central depot and the customers: one; because of the high value of the commodities transported, the risk of ambush and robbery are very high. Two; the ...
متن کاملMulti-AGV path planning with double-path constraints by using an improved genetic algorithm
This paper investigates an improved genetic algorithm on multiple automated guided vehicle (multi-AGV) path planning. The innovations embody in two aspects. First, three-exchange crossover heuristic operators are used to produce more optimal offsprings for getting more information than with the traditional two-exchange crossover heuristic operators in the improved genetic algorithm. Second, dou...
متن کاملEfficiency of a multi-objective imperialist competitive algorithm: A bi-objective location-routing-inventory problem with probabilistic routes
An integrated model considers all parameters and elements of different deficiencies in one problem. This paper presents a new integrated model of a supply chain that simultaneously considers facility location, vehicle routing and inventory control problems as well as their interactions in one problem, called location-routing-inventory (LRI) problem. This model also considers stochastic demands ...
متن کاملA bi-criteria path planning algorithm for robotics applications
Realistic path planning applications often require optimizing with respect to several criteria simultaneously. Here we introduce an efficient algorithm for bi-criteria path planning on graphs. Our approach is based on augmenting the state space to keep track of the “budget” remaining to satisfy the constraints on secondary cost. The resulting augmented graph is acyclic and the primary cost can ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronics
سال: 2020
ISSN: 2079-9292
DOI: 10.3390/electronics9091351